Two Topics in Online Auctions

نویسندگان

  • Damian Ronald Beil
  • Lawrence M. Wein
  • James B. Orlin
  • Edward Pennell
چکیده

This thesis studies two operations management topics in online auctions, and is di-vided into two parts.Motivated by the increasing use of ShopBots to scan Internet auctions, the firstpart of the thesis analytically examines whether or not two competing auctioneersselling the same commodity should share, or pool, some or all of their bidders. Un-der pooling, the bidding population is represented by three compartments: biddersdedicated to auction 1, bidders dedicated to auction 2, and pooled bidders partici-pating in both auctions simultaneously. Under a bidder strategy shown to induce aBayesian equilibrium, a closed form expression for the auctioneers’ expected revenueunder pooling is found, and pooling is recommended where it produces a greater ex-pected revenue than no pooling (i.e., our objective is revenue maximization). Poolingis generally found to be beneficial as long as the two auctions are not too asymmet-ric and the underlying valuation distribution has certain concavity characteristics.Asymptotic order statistic arguments are used where explicit characterizations areintractable.The second part of the thesis considers a manufacturer who uses a reverse, orprocurement, auction to determine which supplier will be awarded a contract. Eachbid consists of a price and a set of non-price attributes (e.g., quality, lead time).The manufacturer is assumed to know the suppliers’ cost functions (in terms of thenon-price attributes). We analyze how the manufacturer chooses a scoring rule (i.e.,a function that ranks the bids in terms of the price and non-price attributes) thatattempts to maximize his own utility. Under the assumption that suppliers submittheir myopic best-response bids (i.e., they choose their minimum-cost bid to achieveany given score), our proposed scoring rule indeed maximizes the manufacturer’sutility within the open-ascending format. The analysis reveals connections betweenthe manufacturer’s utility maximization problem and various geometric aspects of themanufacturer’s utility and the suppliers’ cost functions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Special Issue: Process and Service-Based Applications

The conference Web site is: http://www.it-innovations.ae. Five papers were selected from the conference and the authors were invited to extend their papers and submit to IJIIT for publication consideration. These papers went through another round of accelerated review and revision and four papers were finally accepted. IIT'05 was organized by the College of Information Technology, of the UAE Un...

متن کامل

Multi-Unit Auctions

We survey experimental research on multi-unit auctions with an emphasis on topics that may be of a unifying interest to experimental, as well as theoretical and empirical economists. Topics include static and dynamic multi-unit auctions; combinatorial auctions and efficient auction design; simultaneous and sequential auctions; bidder asymmetry and endogenous entry, and collusion in auctions. We...

متن کامل

A Formal Approach to Detecting Shilling Behaviors in Concurrent Online Auctions

Shilling behaviors are one of the most serious fraud problems in online auctions, which make winning bidders have to pay more than what they should pay for auctioned items. In concurrent online auctions, where multiple auctions for the same type of items are running simultaneously, shilling behaviors can be even more severe because detecting, predicting and preventing such fraudulent behaviors ...

متن کامل

Offline Evaluation of Response Prediction in Online Advertising Auctions

Click-through rates and conversion rates are two core machine learning problems in online advertising. The evaluation of such systems is often based on traditional supervised learning metrics that ignore how the predictions are used. These predictions are in fact part of bidding systems in online advertising auctions. We present here an empirical evaluation of a metric that is specifically tail...

متن کامل

2000: Agent-based Simulation of Dynamic Online Auctions

The need to understand dynamic behavior in auctions is increasing with the popularization of online auctions. Applications include designing auction mechanisms, bidding strategies, and server systems. We describe simulations of a typical online auction, where the duration is fixed, and the second-highest price is continuously posted and determines the winner’s payment. We modeled agents of exac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003